A Higher-Order Calculus for Categories
نویسندگان
چکیده
A calculus for a fragment of category theory is presented. The types in the language denote categories and the expressions functors. The judgements of the calculus systematise categorical arguments such as: an expression is functorial in its free variables; two expressions are naturally isomorphic in their free variables. There are special binders for limits and more general ends. The rules for limits and ends support an algebraic manipulation of universal constructions as opposed to a more traditional diagrammatic approach. Duality within the calculus and applications in proving continuity are discussed with examples. The calculus gives a basis for mechanising a theory of categories in a generic theorem prover like Isabelle.
منابع مشابه
The Logic of the Partial λ-Calculus With Equality
We investigate the logical aspects of the partial λ-calculus with equality, exploiting an equivalence between partial λ-theories and partial cartesian closed categories (pcccs) established here. The partial λ-calculus with equality provides a full-blown intuitionistic higher order logic, which in a precise sense turns out to be almost the logic of toposes, the distinctive feature of the latter ...
متن کاملSLIDING MODE CONTROL BASED ON FRACTIONAL ORDER CALCULUS FOR DC-DC CONVERTERS
The aim of this paper is to design a Fractional Order Sliding Mode Controllers (FOSMC)for a class of DC-DC converters such as boost and buck converters. Firstly, the control lawis designed with respect to the properties of fractional calculus, the design yields an equiv-alent control term with an addition of discontinuous (attractive) control law. Secondly, themathematical proof of the stabilit...
متن کاملAction Calculi III : Higher-order Calculi
This paper extends an arbitrary action calculus [11] to higher order, in a way which parallels the extension of the -calculus [13] to higher order by Sangiorgi [18]. Action calculi are a subclass of action structures [10], which in turn are an enriched class of monoidal categories. Each action calculus AC(K) is distinguished by its set K of controls and their reaction rules. The notion of actio...
متن کاملThe HasCasl Prologue: Categorical Syntax and Semantics of the Partial λ-Calculus
We develop the semantic foundations of the specification language HasCasl, which combines algebraic specification and functional programming on the basis of Moggi’s partial λ-calculus. Generalizing Lambek’s classical equivalence between the simply typed λ-calculus and cartesian closed categories, we establish an equivalence between partial cartesian closed categories (pccc’s) and partial λ-theo...
متن کاملHistory of Lambda-calculus and Combinatory Logic
8 Types 23 8.1 The general development of type theories . . . . . . . . . . . . . . . 23 8.1.1 Types as grammatical categories . . . . . . . . . . . . . . . . 24 8.1.2 Types as sets . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 8.1.3 Types as objects . . . . . . . . . . . . . . . . . . . . . . . . . 26 8.1.4 Types as propositions . . . . . . . . . . . . . . . . . . . . . . 30 8.2 Ear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001